Refinement of Kripke Models for Dynamics
نویسندگان
چکیده
ions of the Muddy Children for n = 3 children. f (1) = f (2) = A, f (3) = 3 and g = Id . D3 /// means proposition D3 has valuation ? in the current state. Francien Dechesne, Yanjing Wang and Simona Orzan Refinement of Kripke Models for Dynamics Introduction Abstraction/Refinement and Logical Characterization An Example Conclusions Muddy Children Abstraction of n=3 case D1D2D3 /// D1D3 /// 3 A D3 D2D3 ///
منابع مشابه
Refinement Quantified Logics of Knowledge and Belief for Multiple Agentsc
Given the “possible worlds” interpretation of modal logic, a refinement of a Kripke model is another Kripke model in which an agent has ruled out some possible worlds to be consistent with some new information. The refinements of a finite Kripke model have been shown to correspond to the results of applying arbitrary action models to the Kripke model [10]. Refinement modal logics add quantifier...
متن کاملAbstract Model Repair
Model Repair George Chatzieleftheriou, Borzoo Bonakdarpour, Scott A. Smolka, and Panagiotis Katsaros 1 Department of Informatics, Aristotle University of Thessaloniki 54124 Thessaloniki, Greece 2 School of Computer Science, University of Waterloo 200 University Avenue West Waterloo N2L3G1, Canada 3 Department of Computer Science, Stony Brook University Stony Brook, NY 11794-4400, USA Abstract. ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn the Complexity of Semantic Self-minimization
Partial Kripke structures model only parts of a state space and so enable aggressive abstraction of systems prior to verifying them with respect to a formula of temporal logic. This partiality of models means that verifications may reply with true (all refinements satisfy the formula under check), false (no refinement satisfies the formula under check) or don’t know. Generalized model checking ...
متن کاملGeneralized Strong Preservation by Abstract Interpretation
Many algorithms have been proposed for reducing the state space of a Kripke structure in order to obtain a minimal abstract structure that strongly preserves a given temporal specification language. These are partition refinement algorithms, namely they work on standard abstract models which are partitions of the state space States . In an abstract interpretation-based view, we show that state ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008